On the total domination number of total graphs

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Total Roman domination subdivision number in graphs

A {em Roman dominating function} on a graph $G$ is a function $f:V(G)rightarrow {0,1,2}$ satisfying the condition that every vertex $u$ for which $f(u)=0$ is adjacent to at least one vertex $v$ for which $f(v)=2$. A {em total Roman dominating function} is a Roman dominating function with the additional property that the subgraph of $G$ induced by the set of all vertices of positive weight has n...

متن کامل

Total Domination number of Generalized Petersen Graphs

Generalized Petersen graphs are an important class of commonly used interconnection networks and have been studied . The total domination number of generalized Petersen graphs P(m,2) is obtained in this paper.

متن کامل

Total domination number of grid graphs

We use the link between the existence of tilings in Manhattan metric with {1}-bowls and minimum total dominating sets of Cartesian products of paths and cycles. From the existence of such a tiling, we deduce the asymptotical values of the total domination numbers of these graphs and we deduce the total domination numbers of some Cartesian products of cycles. Finally, we investigate the problem ...

متن کامل

DOMINATION NUMBER OF TOTAL GRAPH OF MODULE

 Let $R$ be a commutative ring and $M$ be an $R$-module with $T(M)$ as subset, the set of torsion elements. The total graph of the module denoted by $T(Gamma(M))$, is the (undirected) graph with all elements of $M$ as vertices, and for distinct elements $n,m in M$, the vertices $n$ and $m$ are adjacent if and only if $n+m in T(M)$. In this paper we study the domination number of $T(Gamma(M))$ a...

متن کامل

On the Total Domination Number of Cartesian Products of Graphs

Let γ {k} t (G) denote the total {k}-domination number of graph G, and let G H denote the Cartesian product of graphs G and H . In this paper, we show that for any graphs G and H without isolated vertices, γ {k} t (G)γ {k} t (H) ≤ k(k + 1)γ {k} t (G H). As a corollary of this result, we have γt (G)γt (H) ≤ 2γt (G H) for all graphs G and H without isolated vertices, which is given by Pak Tung Ho...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Discussiones Mathematicae Graph Theory

سال: 2022

ISSN: ['1234-3099', '2083-5892']

DOI: https://doi.org/10.7151/dmgt.2478